Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((ZENG Ming[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Improved hybrid cuckoo search-based quantum-behaved particle swarm optimization algorithm for bi-level programming
ZENG Minghua, QUAN Ke
Journal of Computer Applications 2020, 40 (
7
): 1908-1912. DOI:
10.11772/j.issn.1001-9081.2019122237
Abstract
(
354
)
PDF
(881KB)(
367
)
Knowledge map
Save
Because the Particle Swarm Optimization (PSO) algorithm is easily trapped into local optimal solutions when solving the bi-level programming problems, an Improved hybrid Cuckoo Search-based Quantum-behaved Particle Swarm Optimization (ICSQPSO) algorithm based on Simulated Annealing (SA) Metropolis criterion was proposed. Firstly, the Metropolis criterion of SA algorithm was introduced into the hybrid algorithm to enhance the global optimization ability by accepting good solutions as well as bad solutions with a probability during solving process. Secondly, a Lévy flight with dynamic step size was designed for cuckoo search algorithm in order to maintain the high diversity of particle swarm during optimization, so as to guarantee search range. Finally, the preference random walk mechanism in the cuckoo algorithm was used to help the particles jump out of local optimal solutions. The numerical results of 13 bi-level programming cases including nonlinear ones, fractional ones, and those with multiple lower levels show that the objective functions optimal values of 12 cases obtained by ICSQPSO algorithm are significantly better than those of the algorithms for comparison in literatures, only the result of 1 case is slightly worse, and the results of half of the 13 cases are 50% better than those of the algorithms to be compared. Therefore, the ICSQPSO algorithm is superior to the algorithms to be compared on the optimization ability for bi-level programming.
Reference
|
Related Articles
|
Metrics
Select
Electric vehicle charging scheduling scheme oriented to traveling plan
ZENG Ming, LENG Supeng, ZHANG Ke
Journal of Computer Applications 2016, 36 (
8
): 2332-2334. DOI:
10.11772/j.issn.1001-9081.2016.08.2332
Abstract
(
545
)
PDF
(636KB)(
413
)
Knowledge map
Save
Due to the deficiency of ubiquitous charging stations (or stakes) and short driving distances of Electric Vehicle (EV), many people are hesitant to use EV. To reduce users' anxiety about limited battery capacity and lower fees due to frequent charging and making detour to charge, a matching theoretic Traveling Plan-aware Charging Scheduling (TPCS) scheme was proposed. Firstly, preference lists of EV users and charging stations were constructed respectively according to traveling plans of EV and their electricity demand at each charging station. Secondly, a many-to-one matching model was established between EV users and charging stations. Finally, interfaces of charging stations were allocated to optimize the system total utility. Compared with the Random Charging Scheduling (RCS) algorithm and Only utility of Electric Vehicle concerned Scheduling (OEVS) algorithm, the system total utility of TPCS was increased at most by 39.3% and 5% respectively. In addition, TPCS guaranteed the satisfactory ratio of EV users to be above 90% when charging demand of EV users was light, which is higher than that of RCS. The proposed algorithm can effectively improve the system total utility and satisfactory ratio of EV users, and reduce the computational complexity.
Reference
|
Related Articles
|
Metrics